IP Lookup By Binary Search On Prefix Length
نویسندگان
چکیده
منابع مشابه
A New Efficient Binary Search on Range for IP Address Lookup
IP address lookup is an important function to meet such requirements as high speed, memory size and low power for the overall performance of the routers. The biggest problem of IP address lookup is that prefixes has a variable length so that longest prefix match should be employed for IP address lookup. Binary search is useful to decrease search times. But binary search is only adaptable to an ...
متن کاملAn Efficient IP Address Lookup Scheme Using Balanced Binary Search with Minimal Entry and Optimal Prefix Vector
Although IP address lookup schemes using ternary content addressable memory (TCAM) can perform high speed packet forwarding, TCAM is much more expensive than ordinary memory in implementation cost. As a low-cost solution, binary search algorithms such as a binary trie or a binary search tree have been widely studied. This paper proposes an efficient IP address lookup scheme using balanced binar...
متن کاملIP Lookup in IPv6 Networks
The IP Lookup Process is a key bottleneck in routing because of increasing routing table sizes, increasing traffic, higher speed links, and migration to 128-bit IPv6 addresses. The IP routing lookup involves computation of the best matching prefix (BMP) for which existing solutions, such as BSD Radix Tries, scale poorly when traffic in the router increases or when employed for IPv6 address look...
متن کامل1P Lookups using Multiway and Multicolurnn Search
IP address lookup is becoming critical because of increasing routing table size, speed, and traffic in the Internet. Our paper shows how binary search can be adapted for best matching prefix using two entries per prefix and by doing precomputation. Next we show how to improve the performance of any best matching prefix scheme using an initial array indexed by the first X bits of the address. We...
متن کاملBinary search schemes for fast IP lookups
IP route look up is the most time consuming operation of a router. Route lookup is becoming a very challenging problem due to the increasing size of routing tables. To reduce the number of entries, routing tables store variable length address prefixes. To determine the outgoing port for a given address, the longest matching prefix amongst all the prefixes, needs to be determined. This makes the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Interconnection Networks
دوره 3 شماره
صفحات -
تاریخ انتشار 2002